Automatically Inferring Structure Correlated Variable Set for Concurrent Atomicity Safety

Automatically Inferring Structure Correlated Variable Set for Concurrent Atomicity Safety

The atomicity of correlated variables is quite tedious and error prone for programmers to explicitly infer and specify in the multi-threaded program. Researchers have studied the automatic discovery of atomic set programmers intended, such as by frequent itemset mining and rules-based filter. However, due to the lack of inspection of inner structure, some implicit sematics independent variables...

Atomicity for Concurrent Programs

Monitoring Atomicity in Concurrent Programs

We study the problem of monitoring concurrent program runs for atomicity violations. Unearthing fundamental results behind scheduling algorithms in database control, we build space-efficient monitoring algorithms for checking atomicity that use space polynomial in the number of active threads and entities, and independent of the length of run monitored. Second, by interpreting the monitoring al...

Inferring Network Invariants Automatically

Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P , a network invariant for P is a system that abstracts the composition of every number of copies of P running in parallel. If there is such a network invariant, by reasoning about it, uniform verification with respect to the family P [1] ‖ · · · ‖ P [n] can be carried out. ...

Automatically Inferring Database Schemas

The goal of this research is to investigate the possibility of automatically inferring a database schema. Our motivation is to make the task of the database designer easier. We require the designer only to provide a picture of how s/he expects the database to be used. This is provided in the form of natural language queries which the database might be expected to answer. The system synthesises ...